Strategic intelligence during coin detention operations – relational data and understanding latent terror networks

One aspect of the global “War on Terror” that has received limited coverage in the academic literature is the problem of detained persons as it relates to intelligence. This is a surprising oversight, given the number of detainees that the USA has been responsible for (over 25,000 were in custody in Iraq alone at one time during its peak). The detention environment offers a prime strategic intelligence opportunity for the US intelligence community to study the tactics and organizations of individuals who have been removed from the overall conflict. In this article an easily implemented collection program is recommended to be deployed in US/coalition detention centers. The primary recommendation is to gather relational data on detainee communication, both authorized and illicit, and to use these data to perform network analyses of terrorist groups and their individual members.     

一种基于模糊竞争网络的主动声纳目标分类器

提出了一种基于模糊竞争网络的主动声纳目标分类器。该分类器结构简单,学习速度快,仅用少量样本进行训练便可获得良好的推广性能．便于实时学习和应用。通过对模式属于各类别的隶属度的分析,可以知道判决的可靠性,具有较好的应用价值。     

未知非线性系统的神经网络建模与控制仿真研究

针对一类未知非线性系统的建模与控制问题,采用基于神经网络的多步预测控制算法进行了仿真研究,仿真对象选取控制工程界常用的单摆试验装置.该算法的实现步骤为:获取系统开环试验数据;辨识神经网络正向动态模型;设计非线性优化控制律.仿真研究结果表明,所提出的建模与控制方法是有效的.     

具有变时滞的离散型随机BAM神经网络的稳定性

研究一类具有变时滞的离散型随机BAM神经网络。通过构造Lyapunov泛函以及线性矩阵不等式（LMI）,得出了离散系统全局渐近稳定的充分条件。     

基于弱多径覆盖的虚电路恢复策略研究

虚电路技术可以为Ad Hoc网络中的节点提供面向连接的服务。然而,由于拓扑动态性等特征,Ad Hoc网络中的虚电路容易断开,从而导致业务时延、时延抖动增大甚至通信中断等问题。为此文章提出了一种基于弱多径覆盖的虚电路恢复策略,通过将虚电路机制与弱多径覆盖多径策略相结合,可以有效地减少虚电路恢复时间和需要重新预约资源的节点的数量。理论分析和仿真结果表明了该方法的有效性。     

基于小波包变换和BP网络的齿轮箱故障诊断

利用小波包分析提取出齿轮箱在各种工况下振动信号的有效成分,根据时频域特点提取比较典型的特征参量,利用改进的BP网络进行训练,根据训练结果判别齿轮箱的故障状态。     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

L+1容错恢复策略在复杂军事网络中的应用仿真

以标准3×3网格为基础网络,介绍了L+1容错恢复策略的概念和恢复原理,以海上舰艇编队作战系统网络为研究对象,使用Matlab-Simulink仿真工具,通过对阻塞概率、平均路径长度、路径重新分配概率和有效利用率4个指标的仿真,对比了该网络在无策略、备份多路和L+1容错恢复3种策略下网络的恢复程度,验证了L+1容错恢复策略的有效性和可行性。     

基于Petri网的综合电子系统仿真网络设计与分析

针对综合电子系统仿真过程中存在的网络拓扑结构实现、信息要素对应及网络数据安全问题,采用Petri网理论设计了综合电子系统总体网络仿真方案并加以实现。在验证方案正确性的基础上,以某型步兵战车综合电子系统网络为研究对象,对其子网性能指标进行了分析,验证了系统网络仿真方案的有效性,为综合电子系统仿真及分析提供了借鉴。     

一种能量高效和均衡的无线传感器网络分簇数据融合算法

在无线传感器网络中,如果传感器节点之间的能耗不均衡,一些能耗进度较快的节点会过快失效,继而导致网络过早无法正常工作。为了解决分簇无线传感器网络在数据收集过程中所存在的节点之间能耗不均衡问题,提出了一种新的分簇数据融合算法。该算法将网络划分为大小不等的栅格,并根据剩余能量使簇首分别在每个栅格的节点中轮转。簇首消耗的能量越多,其所在的栅格也越大,栅格内有更多节点参与簇首的轮换以分担能量负载。通过该方式,算法能够提高节点的能耗均衡程度。另外,考虑到无线传感器网络的能量受限,算法还采取了一系列措施以节约能量。仿真实验结果表明,算法在能量使用效率、网络生命周期以及能耗均衡程度三个方面都具有较好的性能。